Reformulating the traffic equilibrium problem via a smooth gap function
نویسندگان
چکیده
منابع مشابه
On a Smooth Dual Gap Function for a Class of Player Convex Generalized Nash Equilibrium Problems
We consider a class of generalized Nash equilibrium problems (GNEPs) where both the objective functions and the constraints are allowed to depend on the decision variables of the other players. It is well-known that this problem can be reformulated as a constrained optimization problem via the (regularized) Nikaido-Isoda-function, but this reformulation is usually nonsmooth. Here we observe tha...
متن کاملA hybrid Newton method for solving the variational inequality problem via the D-gap function
The variational inequality problem (VIP) can be reformulated as an unconstrained minimization problem through the D-gap function. It is proved that the D-gap function has bounded level sets for the strongly monotone VIP. A hybrid Newton-type method is proposed for minimizing the D-gap function. Under some conditions, it is shown that the algorithm is globally convergent and locally quadraticall...
متن کاملThe Traffic Equilibrium Problem with Nonadditive Path Costs
In this paper we present a version of the (static) traac equilibrium problem in which the cost incurred on each path is not simply the sum of the costs on the arcs that constitute that path. We motivate this nonadditive version of the problem by describing several situations in which the classic additivity assumption fails. We describe existence and uniqueness conditions for this problem and we...
متن کاملMethods of Reducing the Number of Effective ODs in Order to Solve Traffic Equilibrium Problem in Real Life Networks
Solving traffic equilibrium problem, or “traffic assignment”, as the last step in Transportation Planning, distributes OD trip demands of a transportation network over the network links with regard to Traffic Equilibrium Law, and estimates the link flows. In formulations of traffic equilibrium which are based on path saving, the memory consumption is considerably affected by the number of effct...
متن کاملMethods of Reducing the Number of Effective ODs in Order to Solve Traffic Equilibrium Problem in Real Life Networks
Solving traffic equilibrium problem, or “traffic assignment”, as the last step in Transportation Planning, distributes OD trip demands of a transportation network over the network links with regard to Traffic Equilibrium Law, and estimates the link flows. In formulations of traffic equilibrium which are based on path saving, the memory consumption is considerably affected by the number of effct...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical and Computer Modelling
سال: 2000
ISSN: 0895-7177
DOI: 10.1016/s0895-7177(99)00231-9